Piecewise Monotone Polynomial Approximation
نویسندگان
چکیده
منابع مشابه
Remarks on Piecewise Polynomial Approximation
The theoretical and experimental background for the approximation of "real-world" functions is reviewed to motivate the use of piecewise polynomial approximations. It is possible in practice ~o achieve the results suggested by the theory for piecewise polynomials. A convergent adaptive algorithm is outlined which effectively and efficiently computes smooth piecewise polynomial approxImations to...
متن کاملOn 3-monotone approximation by piecewise polynomials
Abstract. We consider 3-monotone approximation by piecewise polynomials with prescribed knots. A general theorem is proved, which reduces the problem of 3-monotone uniform approximation of a 3-monotone function, to convex local L1 approximation of the derivative of the function. As the corollary we obtain Jackson-type estimates on the degree of 3-monotone approximation by piecewise polynomials ...
متن کاملPointwise Estimates for Monotone Polynomial Approximation
We prove that if f is increasing on [ 1,1], then for each n = 1, 2 . . . . . there is an increasing algebraic polynomial P. of degree n such that {f(x) P.(x){ < cw2( f, V/I x 2 /n) , where w2 is the second-order modulus of smoothness. These results complement the classical pointwise estimates of the same type for unconstrained polynomial approximation. Using these results, we characterize the m...
متن کاملNonlinear piecewise polynomial approximation: Theory and Algorithms
Nonlinear piecewise polynomial approximation: Theory and Algorithms Borislav Karaivanov We study nonlinear n-term approximation in Lp(R) (0 < p < ∞) from Courant elements or (discontinuous) piecewise polynomials generated by multilevel nested triangulations of R which allow arbitrarily sharp angles. To characterize the rate of approximation we introduce and develop three families of smoothness ...
متن کاملFiltering Motion Data Through Piecewise Polynomial Approximation
In this work we propose a system to filter human movement data and store them into a compact representation. We are interested both in noise reduction and in segmentation. The method described in this paper relies on a iterative optimization and guarantee to converge to a local optimum: it proved anyway to produce stable results and to provide an accurate segmentation on the analyzed data . We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1972
ISSN: 0002-9947
DOI: 10.2307/1996363